Testing Expansion in Bounded-Degree Graphs
نویسندگان
چکیده
منابع مشابه
On Testing Expansion in Bounded-Degree Graphs
We consider testing graph expansion in the bounded-degree graph model. Specifically, we refer to algorithms for testing whether the graph has a second eigenvalue bounded above by a given threshold or is far from any graph with such (or related) property. We present a natural algorithm aimed towards achieving the foregoing task. The algorithm is given a (normalized) eigenvalue bound λ < 1, oracl...
متن کاملTesting Expansion in Bounded Degree Graphs
We consider the problem of testing graph expansion in the bounded degree model. We give a property tester that given a graph with degree bound d, an expansion bound α, and a parameter ε > 0, accepts the graph with high probability if its expansion is more than α, and rejects it with high probability if it is ε-far from any graph (with degree bound 2d) with expansion Ω(α). The algorithm runs in ...
متن کاملAn Expansion Tester for Bounded Degree Graphs
We consider the problem of testing graph expansion (either vertex or edge) in the bounded degree model (Goldreich & Ron, ECCC 2000). We give a property tester that takes as input a graph with degree bound d, an expansion bound α, and a parameter ε > 0. The tester accepts the graph with high probability if its expansion is more than α, and rejects it with high probability if it is ε-far from any...
متن کاملQuantum Property Testing for Bounded-Degree Graphs
We study quantum algorithms for testing bipartiteness and expansion of bounded-degreegraphs. We give quantum algorithms that solve these problems in time Õ(N), beating theΩ(√N) classical lower bound. For testing expansion, we also prove an Ω̃(N) quantum querylower bound, thus ruling out the possibility of an exponential quantum speedup. Our quantumalgorithms follow fr...
متن کاملQuantum algorithms for testing bipartiteness and expansion of bounded-degree graphs (preliminary version)
We study quantum algorithms for testing properties of sparse graphs. Let G be a boundeddegree graph on N vertices. Given an oracle that answers queries of the form “what is the ith neighbor of vertex v?”, the problem is to distinguish whether G is bipartite or far from bipartite. A result of Goldreich and Ron shows that the classical query complexity of this task is Ω( √ N). We present a quantu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2010
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s096354831000012x